Kleene's Logic, Generalized
نویسنده
چکیده
Kleene’s well-known strong three-valued logic is shown to be one of a family of logics with similar mathematical properties. These logics are produced by an intuitively natural construction. The resulting logics have direct relationships with bilattices. In addition they possess mathematical features that lend themselves well to semantical constructions based on fixpoint procedures, as in logic programming.
منابع مشابه
A lattice of implicative extensions of regular Kleene's logics
A b s t r a c t. The paper deals with functional properties of three-valued logics. We consider the family of regular three-valued Kleene's logics (strong, weak, intermediate) and it's extensions by adding an implicative connectives (" natural " implications). The main result of our paper is the lattice that describes the relations between implicative extensions of regular logics. In this paper...
متن کاملKleene's Amazing Second Recursion Theorem
Part 1. Self-reference . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1. Self reproducing Turing machines . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2. Myhill’s characterization of r.e.-complete sets . . . . . . . . . . . . . . . . . . . . . . . . . 5 3. The Myhill-Shepherdson Theorem . . . . . . . . . ....
متن کاملRealizability Semantics for Quantified Modal Logic: Generalizing Flagg's 1985 Construction
A semantics for quantified modal logic is presented that is based on Kleene's notion of realizability. This semantics generalizes Flagg's 1985 construction of a model of a modal version of Church's Thesis and first-order arithmetic. While the bulk of the paper is devoted to developing the details of the semantics, to illustrate the scope of this approach, we show that the construction produces ...
متن کاملKleene's Three-Valued Logic and Process Algebra
We propose a combination of Kleene’s three-valued logic and ACP process algebra via the guarded command construct. We present an operational semantics in SOS-style, and a completeness result. 1998 Elsevier Science B.V. All rights reserved.
متن کاملInduktive Definitionen und Dilatoren
In this paper we give a new and comparatively simple proof of the following theorem by Girard [1]: "If Vx e (9t y ~ (9~p(x, y) (where the relation ~p is arithmetic and positive in Kleene's C), then there exists a recursive Dilator D such that V~ > co Vx ~ (9<~t y~(9<~ y). '' The essential feature of our proof is its very direct definition of the dilator D. Within a certain infinitary cutfree sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 1 شماره
صفحات -
تاریخ انتشار 1991